A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
نویسندگان
چکیده
We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports insertion and removal vertices (together with its incident edges). The main feature is it outputs minimally non-PCA induced subgraph when vertex fails. Each operation cost O(logn+d) time, where n number d degree modified vertex. When removals are disallowed, each processed in O(d) time. also provides two constant-time operations to query if graph Helly (PHCA) or interval (PIG). not PHCA (resp. PIG), non-PHCA non-PIG) obtained.
منابع مشابه
A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs,that supports the insertion and removal of vertices (together with its incident edges). Themain feature of the algorithm is that it outputs a minimally non-PCA induced subgraphwhen the insertion of a vertex fails. Each operation cost O(logn + d) time, where n is thenumber vertices and d is...
متن کاملCertifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
We give two new algorithms for recognizing proper circulararc graphs and unit circular-arc graphs. The algorithms either provide a model for the input graph, or a certificate that proves that such a model does not exist and can be authenticated in O(n) time.
متن کاملForbidden structure characterization of circular-arc graphs and a certifying recognition algorithm
A circular-arc graph is the intersection graph of arcs of a circle. It is a well-studied graph model with numerous natural applications. A certifying algorithm is an algorithm that outputs a certificate, along with its answer (be it positive or negative), where the certificate can be used to easily justify the given answer. While the recognition of circular-arc graphs has been known to be polyn...
متن کاملProper Helly Circular-Arc Graphs
A circular-arc model M = (C,A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has the same length then M is a unit circular-arc model and if A satisfies the Helly Property then M is a Helly circular-arc model. A (proper) (unit) (Helly) circular-arc graph is the intersection graph of the arcs of a (...
متن کاملHadwiger's conjecture for proper circular arc graphs
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc representation where no arc is completely contained in any other arc. Hadwiger’s conjecture states that if a graph G has chromatic number k, then a complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.07.040